Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
نویسندگان
چکیده
منابع مشابه
Error-Correcting Output Codes Guided Quantization for Biometric Hashing
In this paper, we present a new biometric verification system. The proposed system employs a novel biometric hashing scheme that uses our proposed quantization method. The proposed quantization method is based on error-correcting output codes which are used for classification problems in the literature. We improve the performance of the random projection based biometric hashing scheme proposed ...
متن کاملPerfect Byte-Correcting Codes
We present a few new constructions for perfect linear single byte-correcting codes. These constructions generate some perfect single byte-correcting codes with new parameters, and some perfect single bytecorrecting codes with known parameters and simpler presentation and implementation over the known codes. It is also shown that nonequivalent perfect linear single byte-correcting codes exist wh...
متن کاملAlternate Labelings for Graphs Representing Perfect-One-Error-Correcting Codes
Alternate labelings for oneand two-dimensional graphs which support perfectone-error-correcting codes are provided, and their “efficiency” is compared with previously-known labelings using the concept of the finite state machine. These labelings are produced by altering the finite state machines used for recognition and error-correction for the previously known labelings. It is discovered that ...
متن کاملPerfect One Error Correcting Codes on Iterated Complete Graphs
Given an arbitrary graph, a perfect one error correcting code is a subset of the vertices called codewords such that no two codewords are adjacent and every non-codeword is adjacent to exactly one codeword. Determining if there is a perfect one error correcting code on an arbitrary graph seems di cult; in fact, it is NP-Complete. We present a biin nite family of graphs based on the complete gra...
متن کاملTwo-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect
Bose and Chaudhuri (1960) have introduced a class of binary errorcorrecting codes of block length 2 ~ 1, m = 2,3,• • which we refer to here as B-C codes. An efficient decoding scheme has been devised for them by Peterson (1960), and generalized to the natural extension of the B-C Codes to codes in pm symbols by D. Gorenstein and N. Zierler (1960). Two further properties of B-C codes are establi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1997
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v4i17.18813